The Observer Algorithm for Visibility Approximation
نویسندگان
چکیده
We present a novel algorithm for visibility approximation that is substantially faster than ray casting based algorithms. The algorithm does not require extensive preprocessing or specialized hardware as most other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areas, with different view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm uses, it is possible to tailor the algorithm between speed and accuracy.
منابع مشابه
New Optimal Observer Design Based on State Prediction for a Class of Non-linear Systems Through Approximation
This paper deals with the optimal state observer of non-linear systems based on a new strategy. Despite the development of state prediction in linear systems, state prediction for non-linear systems is still challenging. In this paper, to obtain a future estimation of the system states, initially Taylor series expansion of states in their receding horizons was achieved to any specified order an...
متن کاملTradeoffs when Multiple Observer Siting on Large Terrain Cells
This paper demonstrates a toolkit for multiple observer siting to maximize their joint viewshed, on high-resolution gridded terrains, up to 2402 × 2402, with the viewsheds’ radii of up to 1000. It shows that approximate (rather than exact) visibility indexes of observers are sufficient for siting multiple observers. It also shows that, when selecting potential observers, geographic dispersion i...
متن کاملMaintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes∗
Computing the visible region from a moving point in planar environments has many applications in computer graphics and computational geometry. This problem has been considered thoroughly before and several algorithms have been proposed for it. Almost all these solutions use a preprocessing step to build data structures which reflect the visibility coherence of the scene. Then, this data is used...
متن کاملExact Visibility Maintenance in Planar Polygonal Scenes in Practical Applications
In this paper, we are concerned with computing and maintaining the exact visibility polygon V (q) of a moving point observer q in planar scenes represented by a polygon with holes with complexity of n. We propose an algorithm that applies and computes each change to V (q) in constant time as q moves to a new neighboring position. In fact, in our method changes to V (q), as the observer q moves,...
متن کاملPlanar Visibility Counting
For a xed virtual scene (=collection of simplices) S and given observer position ~ p, how many elements of S are weakly visible (i.e. not fully occluded by others) from ~ p? The present work explores the trade-o between query time and preprocessing space for these quantities in 2D: exactly, in the approximate deterministic, and in the probabilistic sense. We deduce the existence of an O(m2=n2) ...
متن کامل